On the Typical Structure of Graphs in a Monotone Property
نویسندگان
چکیده
Given a graph property P, it is interesting to determine the typical structure of graphs that satisfy P. In this paper, we consider monotone properties, that is, properties that are closed under taking subgraphs. Using results from the theory of graph limits, we show that if P is a monotone property and r is the largest integer for which every r-colorable graph satis es P, then almost every graph with P is close to being a balanced r-partite graph.
منابع مشابه
Measures on monotone properties of graphs
Given a monotone property P of graphs, write Pn for the set of graphs with vertex set [n] having property P. Building on recent results in the enumeration of graphical properties, we prove numerous results about the structure of graphs in Pn and the functions |Pn|. We also examine the measure eP (n), the maximum number of edges in a graph of Pn.
متن کاملFr{'e}chet and Hausdorff Queries on $x$-Monotone Trajectories
vspace{0.2cm}In this paper, we design a data structure for the following problem. Let $pi$ be an $x$-monotone trajectory with $n$ vertices in the plane and $epsilon >0$. We show how to preprocess $pi$ and $epsilon$ into a data structure such that for any horizontal query segment $Q$ in the plane, one can quickly determine the minimal continuous fraction of $pi$ whose Fr{'e}chet and Hausdo...
متن کاملComplexes of Directed Graphs 3 2
Let P be a monotone property of directed graphs on n vertices, and let P n denote the abstract simplicial complex whose simplices are the edge sets of graphs having property P. We prove that: 1. If \P = acyclic" then P n is homotopy equivalent to the (n ? 2)-sphere. 2. If \P = not strongly connected" then P n has the homotopy type of a wedge of (n ? 1)! spheres of dimension 2n ? 4. The lattice ...
متن کاملFractal Dimension of Graphs of Typical Continuous Functions on Manifolds
If M is a compact Riemannian manifold then we show that for typical continuous function defined on M, the upper box dimension of graph(f) is as big as possible and the lower box dimension of graph(f) is as small as possible.
متن کاملComputing Graph Properties by Randomized Subcube Partitions
We prove a new lower bound on the randomized decision tree complexity of monotone graph properties. For a monotone graph property $A$ of graphs on $n$ vertices, let $p=p(A)$ denote the threshold probability of $A$, namely the value of $p$ for which a random graph from $G(n,p)$ has property $A$ with probability $1/2$. Then the expected number of queries made by any decision tree for $A$ on such ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. J. Comb.
دوره 21 شماره
صفحات -
تاریخ انتشار 2014